Linear θ-Method and Compact θ-Method for Generalised Reaction-Diffusion Equation with Delay
نویسندگان
چکیده
منابع مشابه
A Fractional Step θ-method for Convection-Diffusion Problems
In this article, we analyze the fractional-step θ method for the time-dependent convectiondiffusion equation. In our implementation, we completely separate the convection operator from the diffusion operator, and stabilize the convective solve using a streamline upwinded PetrovGalerkin (SUPG) method. We establish a priori error estimates and show that optimal values of θ yield a scheme that is ...
متن کاملMaximum Entropy Method Approach to θ Term
In Monte Carlo simulations of lattice field theory with a θ term, one confronts the complex weight problem, or the sign problem. This is circumvented by performing the Fourier transform of the topological charge distribution P (Q). This procedure, however, still causes the flattening phenomenon of the free energy, which prevents one from studying the phase structure. In order to work at this is...
متن کاملA Propagator-θ Beam Propagation Method
A new wide-angle beam propagation method is developed for better modeling of both propagating and evanescent modes. It brings in a parameter θ to connect the [(p − 1)/p] and [p/p] Padé approximants of the one-way propagator. The parameter can be used to adjust the requirements of approximating the propagating modes and suppressing the evanescent modes. Numerical results indicate that a suitable...
متن کاملConvergence and Stability of the Split-Step θ-Milstein Method for Stochastic Delay Hopfield Neural Networks
and Applied Analysis 3 Now we give the definition of local and global errors. Definition 1. Let x(t) denote the exact solution of (1). The local approximate solution x̃(t k+1 ) starting from x(t k ) by SSTM (2) given by x̃ (t k+1 ) := x (t k ) + Λ (x (t k ) , ?̃? (t k ) , h, ΔW k ) , (9) where ?̃?(t k ) denotes the evaluation of (3) using the exact solution, yields the difference δ k+1 := x (t k+1 ...
متن کاملApproximating the Lovász θ Function with the Subgradient Method
The famous Lovász theta number θ(G) is expressed as the optimal solution of a semidefinite program. As such, it can be computed in polynomial time to an arbitrary precision. Nevertheless, computing it in practice yields some difficulties as the size of the graph gets larger and larger, despite recent significant advances of semidefinite programming (SDP) solvers. We present a way around SDP whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Differential Equations
سال: 2018
ISSN: 1687-9643,1687-9651
DOI: 10.1155/2018/6402576